Contraction Coefficients for Borda Mouthpieces
نویسندگان
چکیده
منابع مشابه
Non-manipulable domains for the Borda count
We characterize the preference domains on which the Borda count satisfies Arrow’s “independence of irrelevant alternatives” condition. Under a weak richness condition, these domains are obtained by fixing one preference ordering and including all its cyclic permutations (“Condorcet cycles”). We then ask on which domains the Borda count is non-manipulable. It turns out that it is non-manipulable...
متن کاملA Borda count for partially ordered ballots
The application of the theory of partially ordered sets to voting systems is an important development in the mathematical theory of elections. Many of the results in this area are on the comparative properties between traditional elections with linearly ordered ballots and those with partially ordered ballots. In this paper we present a scoring procedure, called the partial Borda count, that ex...
متن کاملNash implementable domains for the Borda count
* We thank József Mala for posing the question of Nash implementability on restricted domains that led to this research. We are very grateful to two anonymous referees and an associate editor for their helpful comments and suggestions. The second author gratefully acknowledges financial support from the Hungarian Academy of Sciences (MTA) through the Bolyai János research fellowship. Summary. W...
متن کاملNew Approximation for Borda Coalitional Manipulation
We study the problem of Borda Unweighted Coalitional Manipulation, where k manipulators try to manipulate an election on m candidates under the Borda protocol. This problem is known to be NP-hard. While most recent approaches to approximation tried to minimize k, the number of manipulators needed to make the preferred candidate win (thus assuming that the number of manipulators is not limited i...
متن کاملComplexity of and Algorithms for Borda Manipulation
We prove that it is NP-hard for a coalition of two manipulators to compute how to manipulate the Borda voting rule. This resolves one of the last open problems in the computational complexity of manipulating common voting rules. Because of this NP-hardness, we treat computing a manipulation as an approximation problem where we try to minimize the number of manipulators. Based on ideas from bin ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Fluids Engineering
سال: 1986
ISSN: 0098-2202,1528-901X
DOI: 10.1115/1.3242590